经济型CNC系统刀补的实现

为全面解决经济型ＣＮＣ的刀具半径补偿问题，本文提出了新颖的软件实现思想，将复杂的函数运算转化为简单的加减运算，算法简单有效。     

轴承套圈端面磨削方法与加工质量的关系

双端面磨削是轴承行业普遍采用的一种加工方法.本文通过对双端面磨削的加工机理进行分析,指出不同的加工方法对产品质量的影响是不同的;同时对比分析两种磨削方式的优劣,针对不同的产品,提供了合理加工方法的选择途径.     

用线阵CCD精确测量判读镜具观察孔直径

判读镜具观察孔的直径直接影响航空照片中各种目标的观察效果。基于圆孔夫琅和费衍射测量微孔直径的原理和线阵CCD信号串行输出的特点，给出了照片判读镜具中观察孔直径测量的硬件和软件实施方案。最后对实验进行了分析。表明该方法具有科学性与实用性。     

衍射法细丝直径的精密测量

分析了激光衍射法测量细丝直径技术中影响精度的几个主要因素，研究了一种微弱衍射条纹的精密处理及识别技术，有效地提高了测量精度，实测结果表明，文中讨论的技术能在１０￣５０μｍ的范围内实现正负０．１μｍ的重复精度，分辨力优于０．０１μｍ。     

步进电机细分及其在光电测径系统中的应用

叙述了步进电机的细分技术及其测长原理。作为一种测长手段应用于工件直径测量系统中，为提高步进电机细分测长的精度，系统采用了软件补偿的办法，应用光电定位和ＭＣＳ—５１单片机实施控制，构成一种测量范围在１～１００ｍｍ，精度较高，效费比高的光电测径系统。     

Augmenting Trees to Meet Biconnectivity and Diameter Constraints

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2. Received April 19, 1999; revised June 5, 2001.     

倒虹吸管管径计算的迭代法

本文先将倒虹吸管的管径计算公式整理成等式左边只含管径的一次方法，右边含有管径高阶非线性的迭代函数，然后证明该迭代函数收敛，最后利用数学迭代原理给迭代函数右边赋初值，计算左边的管径。继续迭代下去，就能求出倒虹吸管的管径。     

Fast algorithms for computing the diameter of a finite planar set

Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n ²) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.Research of the first author was supported by grant NSERC A 2422. Research of the second author was supported by grants NSERC A 9293, FCAC EQ-1678 and a Killam Senior Research Fellowship awarded by the Canada Council     

The spined cube: A new hypercube variant with smaller diameter

Bijective connection graphs (in brief, BC graphs) are a family of hypercube variants, which contains hypercubes, twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes, etc. It was proved that the smallest diameter of all the known n-dimensional bijective connection graphs (BC graphs) is , given a fixed dimension n. An important question about the smallest diameter among all the BC graphs is: Does there exist a BC graph whose diameter is less than the known BC graphs such as crossed cubes, twisted cubes, Möbius cubes, etc., with the same dimension? This paper answers this question. In this paper, we find that there exists a kind of BC graphs called spined cubes and we prove that the n-dimensional spined cube has the diameter ⌈n/3⌉+3 for any integer n with n?14. It is the first time in literature that a hypercube variant with such a small diameter is presented.     

An alternative objective function for fitting regression trees to functional response variables

Analyses of systems that can be represented by functional responses are becoming common in many scientific disciplines. Functional regression trees (FRT) provide a methodology for modelling such systems. Recent work has focused on fitting models where the response variable is a probability density function, using a splitting criterion that is based on the sum of dissimilarities between the densities. We suggest a different criterion based on deviations of the densities from their mean. We provide motivation and justification for this criterion, and demonstrate its superior performance using an extensive simulation exercise. We discuss the computational aspects of the FRT procedure and show that substantial speed gains can be made through use of a dissimilarity matrix. Our results show that the proposed splitting criterion outperforms both the original and a splitting criterion based on Euclidean distance. Pointwise standard error curves for a predicted functional response can be generated through the fitting procedure, which we demonstrate in a case study with a forestry data set. Supplementary materials are available.